package com.atguigu.practice;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class TheNumOfResult {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        while (scanner.hasNext()){
            String string=scanner.next();
            String[] split = string.split("<br/>");
            StringBuilder sb=new StringBuilder();
            for(int i=0;i<split.length;i++){
                Set<Integer> set=new HashSet<>();
                findFactor(Integer.parseInt(split[i]),set);
                if(i==split.length-1){
                    sb.append(set.size());
                    break;
                }
                sb.append(set.size()+"<br/>");
            }
            System.out.println(sb.toString());
        }
    }
    public static void findFactor(int n,Set<Integer> set){
        if(n==1){
            return;
        }
        for(int i=2;i<=n;i++){
            if(n%i==0){
                set.add(i);
                findFactor(n/i,set);
                break;
            }
        }
    }
}
